Two Large-Scale Network Design Problems

Two Large-Scale Network Design Problems In this work we consider two large-scale network design problems arising in network routing and provisioning. The first problem combines long-term business and design decisions on large-scale telecommunication networks. The problem integrates different elements of network business planning such as capacity expansion, routing and protection and equipment maintenance as well as a complicated pricing model; which altogether make the optimization particularly hard. We propose a scalable optimization algorithm that exploits the structure of the model and produces a fast, high-quality solution. In the second part of this work we consider the maximum concurrent flow problem and analyze one of the first special-purpose approaches, proposed in 1971 by Fratta, Gerla and Kleinrock, and show that it yields a fully polynomial-time approximation scheme.